A note on reverse scheduling with maximum lateness objective
نویسندگان
چکیده
منابع مشابه
Batch scheduling to minimize maximum lateness
We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem. © 1997 Elsevier Science B.V. Kevwords: Analysis of algorithms; Dynamic programming; Production/scheduling
متن کاملScheduling on uniform parallel machines to minimize maximum lateness
We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the EDD rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than pmax, where pmax is the maximum job processing time. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملOne-Operator, Two-Machine Open Shop and Flow Shop Scheduling with Setup Times for Machines and Maximum Lateness Objective
This paper considers a scheduling problem in which a single operator completes a set of n jobs requiring operations on two machines. The operator can perform only one operation at a time, so when one machine is in use the other is idle. After developing general properties of optimal schedules, the paper develops e cient algorithms for minimizing maximum lateness. The algorithm has time complexi...
متن کاملPreemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
We develop an O (q2n + nlogn) algorithm to obtain a preemptive schedule that minimizes maximum lateness when n jobs with given due dates and memory requirements are to be scheduled on m processors (n ≥ m) of given memory sizes. q is the number of distinct due dates. The value of the minimum maximum lateness can itself be found in O(qn + nlogn) time.
متن کاملA note on a single machine scheduling problem with generalized total tardiness objective function
In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. A pseudo-polynomial time solution algorithm is proposed for a special case of this problem. Moreover, we present a new graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted number of tardy jobs on a single machine. The l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2013
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-013-0314-4